Two Rules for Deducing Valid Inequalities for 0-1 Problems
نویسندگان
چکیده
منابع مشابه
A class of valid inequalities for multilinear 0-1 optimization problems
This paper investigates the polytope associated with the classical standard linearization technique for the unconstrained optimization of multilinear polynomials in 0-1 variables. A new class of valid inequalities, called 2-links, is introduced to strengthen the LP relaxation of the standard linearization. The addition of the 2-links to the standard linearization inequalities provides a complet...
متن کاملValid inequalities for problems with additive variable upper
We study the facial structure of a polyhedron associated with the single node relaxation of network flow problems with additive variable upper bounds. This type of structure arises, for example, in production planning problems with setup times and in network certain expansion problems. We derive several classes of valid inequalities for this polyhedron and give conditions under which they are f...
متن کاملValid Inequalities for Problems with Additive Variable Upper Bounds
We study the facial structure of a polyhedron associated with the single node re laxation of network ow problems with additive variable upper bounds This type of structure arises for example in network design expansion problems in production planning problems with setup times We rst derive two classes of valid inequalities for this polyhedron and give the conditions under which they are facet d...
متن کاملValid inequalities for a class of assembly system problems
This paper establishes a foundation for a cutting plane approach to solve a class of problems that are important to assembly systems, including assembly line balancing (ALB), workload smoothing (WS) and assembly system design (ASD). We describe relationships among the integer programming formulations of these problems and recast their relaxations as node packing problems (NPPs). Exploiting the ...
متن کاملOn Two Combination Rules for 0-1-Sequences
Consider two players who compete with each other by successively taking part in a series of ‘win-or-lose’ games for one person, henceforth called trials. Two termination rules are taken into consideration: (i) Stop as soon as one player has reached a prespecified number N of successful trials; (ii) stop after the Nth trial. The player having more successes at the time of termination will be dec...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Applied Mathematics
سال: 1976
ISSN: 0036-1399,1095-712X
DOI: 10.1137/0131054